Finding a Maximum Independent Set in a Sparse Random Graph
نویسندگان
چکیده
منابع مشابه
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graphG is modelled as follows. Every edge is included independently with probability d n , where d is some sufficiently large constant. Thereafter, for some constant α, a subset I of αn vertices is chosen at random, and all edges within this subset are removed. In this model, the planted independent set I...
متن کاملFinding a minimum independent dominating set in a permutation graph
We give an 0 (nlogln) [ime algorirnm for finding a minimum independem dominating se[ in a pennmation graph. TItis improves on ilie previous D(n 3) time algorictun known for solving tllis problem [4]. .,. Dept of CompUlcr Sci., Purdue Univ., West Gf:tyelle, IN 47907. Rcso::trch ~upported by ONR. Contr:lct NOOOI-l-34-K. 0502:md NSF Gl':tnl DCR-8451393, wilh matching funds from AT&T. • o.:pt of Ma...
متن کاملMaximum Independent Set of a Permutation Graph in k Tracks
A maximum weighted independent set of a permutation graph is a maximum subset of noncrossing chords in a matching diagram (i.e., a set of chords with end-points on two horizontal lines). The problem of nding, among all noncrossing subsets of with density at most k, one with maximum size is considered, where the density of a subset is the maximum number of chords crossing a vertical line and k i...
متن کاملAlgorithms for a maximum clique and a maximum independent set of a circle graph
Consider a family of chords i n a c ircle . is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. I n t h i s paper, we describe e f f i c i en t algorithms for finding a ma3cimwn clique and a maximum independent s e t of circle graphs. the number of vertices i n the graph. Key WO&: Circle graph, transi t ive graph, ...
متن کاملTabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
A technique for finding in a graph an independent set with maximum cardinality is presented. It consists of an impiicit enumeration procedure; the procedure uses at various stages bounds on the inde~ndence number of a subgraph. These are obtained by applying an adaptation of Tabu Search. Computational results are given which show that with Tabu Search a competitive algorithm is obtained; the ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2008
ISSN: 0895-4801,1095-7146
DOI: 10.1137/060661090